Balanced environmental games
نویسنده
چکیده
Focus is here on coalitional games among economic agents plagued by aggregate pollutions of diverse sorts. Defecting players presumably pollute more than others. Then, granted convex preferences and technologies, the core is proven nonempty. In fact, under natural assumptions, a specific, computable core solution comes in terms of shadow prices on the said aggregates. Such prices may, in large part, implement the cooperative treaty by clearing a competitive market for emissions.
منابع مشابه
Core of Combined Games *
This paper studies the core of combined games, obtained by summing two coalitional games. It is shown that the set of balanced transferable utility games can be partitioned into equivalence classes of component games whose core is equal to the core of the combined game. On the other hand, for non balanced games, the binary relation associating two component games whose combination has an empty ...
متن کاملLearning about Recycling and Reuse through Pre-School Games
Learning about Recycling and Reuse through Pre-School Games S.M. Shobeyri, Ph.D. H. Meybodi A. Saraadipoor S. Rashidi Environmental education is the most fundamental approach to environmental protection and can begin from the pre-school level and through the use of games. To show the effectiveness of this approach, a random sample of 30 preschoolers of ages 5 and 6 was se...
متن کاملUniversally Balanced Combinatorial Optimization Games
This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization programs, possibly combinatorial, that is subject to integer constraints. In economic settings, the integer requirement reflects some forms of indivis...
متن کاملCores of Combined
This paper studies the core of combined games, obtained by summing two coalitional games. It is shown that the set of balanced transferable utility games can be partitioned into equivalence classes of component games to determine whether the core of the combined game coincides with the sum of the cores of its components. On the other hand, for non-balanced games, the binary relation associating...
متن کاملAgent Failures in Totally Balanced Games and Convex Games
We examine the impact of independent agents failures on the solutions of cooperative games, focusing on totally balanced games and the more speci c subclass of convex games. We follow the reliability extension model, recently proposed in [1] and show that a (approximately) totally balanced (or convex) game remains (approximately) totally balanced (or convex) when independent agent failures are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 33 شماره
صفحات -
تاریخ انتشار 2006